Inductive Inference with Additional Information

Inductive Inference with Additional Information

We consider the problem of inductively inferring a grammar for a language, given (positive) examples of the language and putative (possibly faulty) grammars for the complement of the language. The criterion of success is identification in the limit, defined by E. M. Gold (1967, Inform. and Control 10, 447 474). Additional information is useful insofar as it allows the identification of language...

Inductive Inference by Using Information Compression

Inductive inference is of central importance to all scientific inquiries. Automating the process of inductive inference is the major concern of machine learning researchers. This article proposes inductive inference techniques to address three inductive problems: (1) how to automatically construct a general description, a model, or a theory to describe a sequence of observations or experimental...

Inductive Inference

Children’s Inductive Inference with Synonymous Labels

Prior research indicates that young children can generalize object properties on the basis of category information when it is conveyed by identical labels or semantically similar labels at the same level of taxonomy (i.e., synonyms) (Gelman & Markman, 1986). However, in previous research semantic similarity was confounded with co-occurrence probability. Therefore, it is possible that synonym-ba...

Fixed Parameter Inductive Inference

We investigate a particular inductive inference problem where we are given as input a finite set of ordered triples of the form (wi, bi, ti) such that wi is a bit string, bi is a single bit, and ti is a positive integer written in unary. A machine M is said to match such a triple if M outputs bi on input wi in at most ti steps. We proceed to investigate the fixed parameter problems where we fix...